Extended Resolution Proofs for Conjoining BDDs
نویسندگان
چکیده
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applications and our results allow the use of BDDs instead—or in combination with—established proof generation techniques, based for instance on clause learning. We have implemented a proof generator for propositional logic formulae in conjunctive normal form, called EBDDRES. We present details of our implementation and also report on experimental results. To our knowledge this is the first step towards a practical application of extended resolution.
منابع مشابه
Extended Resolution Proofs for Symbolic SAT Solving with Quantification
Symbolic SAT solving is an approach where the clauses of a CNF formula are represented using BDDs. These BDDs are then conjoined, and finally checking satisfiability is reduced to the question of whether the final BDD is identical to false. We present a method combining symbolic SAT solving with BDD quantification (variable elimination) and generation of extended resolution proofs. Proofs are f...
متن کاملExtended Resolution as Certificates for Propositional Logic
When checking answers coming from automatic provers, or when skeptically integrating them into proof assistants, a major problem is the wide variety of formats of certificates, which forces to write lots of different checkers. In this paper, we propose to use the extended resolution as a common format for every propositional prover. To be able to do this, we detail two algorithms transforming p...
متن کاملAutomated Deduction with Shannon Graphs
Binary Decision Diagrams (BDDs) are a well-known tool for representing Boolean functions. We show how BDDs can be extended to full rst-order logic by integrating means for representing quantiiers. The resulting structures are called Shannon graphs. A calculus based on these Shannon graphs is set up, and its soundness and completeness proofs are outlined. A comparison of deduction with rst-order...
متن کاملReportrapport Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many di erent ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called binary decision diagrams (BDDs) [2, 10]. Experimental evidence suggests that BDDs and resolution based techniques are fundamentally di erent, in the sense that their performance can di er very much on benchmarks [14]. I...
متن کاملResolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many diierent ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. 12] and 9]). Others use so-called binary decision diagrams (BDDs) 2, 10]. Experimental evidence suggests that BDDs and resolution based techniques are fundamentally diierent, in the sense that their performance can diier very much on benchmarks 14]. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006